By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Discrete Mathematics

Table of Contents
Search This Issue
Volume 19, Issue 2, pp. 281-542

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

Circular Distance Two Labeling and the $\lambda$-Number for Outerplanar Graphs

Daphne Der-Fen Liu and Xuding Zhu

pp. 281-293

BibTeX  Abstract Full Text:  PDF

Repeated Angles in Three and Four Dimensions

Roel Apfelbaum and Micha Sharir

pp. 294-300

BibTeX  Abstract Full Text:  PDF

Constructive Bounds on Ordered Factorizations

Don Coppersmith and Moshe Lewenstein

pp. 301-303

BibTeX  Abstract Full Text:  PDF

A Strongly Polynomial Cut Canceling Algorithm for Minimum Cost Submodular Flow

Satoru Iwata, S. Thomas McCormick, and Maiko Shigeno

pp. 304-320

BibTeX  Abstract Full Text:  PDF

Stabilization of Block-Type-Decodability Properties for Constrained Systems

Panu Chaichanavong and Brian H. Marcus

pp. 321-344

BibTeX  Abstract Full Text:  PDF

Optimal Augmentation for Bipartite Componentwise Biconnectivity in Linear Time

Tsan-Sheng Hsu and Ming-Yang Kao

pp. 345-362

BibTeX  Abstract Full Text:  PDF

Classification of Self-Orthogonal Codes over \boldmath$\F_3$ and \boldmath$\F_4$

Iliya Bouyukliev and Patric R. J. Östergard

pp. 363-370

BibTeX  Abstract Full Text:  PDF

On Unavoidable Sets of Word Patterns

Alexander Burstein and Sergey Kitaev

pp. 371-381

BibTeX  Abstract Full Text:  PDF

A Convex Quadratic Characterization of the Lovász Theta Number

Carlos J. Luz and Alexander Schrijver

pp. 382-387

BibTeX  Abstract Full Text:  PDF

Enumeration of Branched Coverings of Nonorientable Surfaces With Cyclic Branch Points

Jin Ho Kwak, Alexander Mednykh, and Valery Liskovets

pp. 388-398

BibTeX  Abstract Full Text:  PDF

Nonseparating Planar Chains in 4-Connected Graphs

Sean Curran, Orlando Lee, and Xingxing Yu

pp. 399-419

BibTeX  Abstract Full Text:  PDF

Resolvable Steiner Quadruple Systems for the Last 23 Orders

L. Ji and L. Zhu

pp. 420-430

BibTeX  Abstract Full Text:  PDF

Bounds on the Travel Cost of a Mars Rover Prototype Search Heuristic

Apurva Mudgal, Craig Tovey, Sam Greenberg, and Sven Koenig

pp. 431-447

BibTeX  Abstract Full Text:  PDF

Labeling Schemes for Small Distances in Trees

Stephen Alstrup, Philip Bille, and Theis Rauhe

pp. 448-462

BibTeX  Abstract Full Text:  PDF

A Class of General Supertree Methods for Nested Taxa

Philip Daniel and Charles Semple

pp. 463-480

BibTeX  Abstract Full Text:  PDF

Polynomial Representations of Symmetric Partial Boolean Functions

Mart de Graaf and Paul Valiant

pp. 481-488

BibTeX  Abstract Full Text:  PDF

Two-Part and k-Sperner Families: New Proofs Using Permutations

Péter L. Erdos, Zoltán Füredi, and Gyula O. H. Katona

pp. 489-500

BibTeX  Abstract Full Text:  PDF

Polyhedral Analysis for the Uncapacitated Hub Location Problem with Modular Arc Capacities

Hande Yaman

pp. 501-522

BibTeX  Abstract Full Text:  PDF

Traffic Grooming in Unidirectional Wavelength-Division Multiplexed Rings with Grooming Ratio C = 6

Jean-Claude Bermond, Charles J. Colbourn, David Coudert, Gennian Ge, Alan C. H. Ling, and Xavier Muñoz

pp. 523-542

BibTeX  Abstract Full Text:  PDF